Dynamic routing for milk-run tours with time windows in stochastic time-dependent networks
نویسندگان
چکیده
We consider finding static yet robust recurring milk-run tours while dynamically routing the vehicle between site visits. The network arcs experience recurrent congestion, leading to stochastic and time-dependent travel times. Based on vehicle location, time of day, and current and projected network congestion states, we generate dynamic routing policies (DRP) for every pair of sites using stochastic dynamic programming (SDP). By simulating DRP we find travel time distributions for each pair of sites which is used to build the robust tour using another SDP formulation. Results are very promising when the algorithms are tested in a simulated network using historical traffic data. 2016 Elsevier Ltd. All rights reserved.
منابع مشابه
Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملTHE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملA Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW - Extended version
We consider a dynamic vehicle routing problem with time windows and stochastic customers (DS-VRPTW), such that customers may request for services as vehicles have already started their tours. To solve this problem, the goal is to provide a decision rule for choosing, at each time step, the next action to perform in light of known requests and probabilistic knowledge on requests likelihood. We i...
متن کاملA Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW
We consider a dynamic vehicle routing problem with time windows and stochastic customers (DS-VRPTW), such that customers may request for services as vehicles have already started their tours. To solve this problem, the goal is to provide a decision rule for choosing, at each time step, the next action to perform in light of known requests and probabilistic knowledge on requests likelihood. We i...
متن کاملDynamic anomaly detection by using incremental approximate PCA in AODV-based MANETs
Mobile Ad-hoc Networks (MANETs) by contrast of other networks have more vulnerability because of having nature properties such as dynamic topology and no infrastructure. Therefore, a considerable challenge for these networks, is a method expansion that to be able to specify anomalies with high accuracy at network dynamic topology alternation. In this paper, two methods proposed for dynamic anom...
متن کامل